Additive One-Dimensional Cellular Automata are Chaotic According to Devaney's Definition of Chaos
نویسندگان
چکیده
We study the chaotic behavior of a particular class of dynamical systems: cellular automata. We specialize the definition of chaos given by Devaney for general dynamical systems to the case of cellular automata. A dynamical system (X,F) is chaotic according to Devaney’s definition of chaos if its ~sition map F is sensitive to the initial conditions, topolo~cally transitive, and has dense periodic orbits on X. Our main result is the proof that all the additive one-dimensional cellular automata defined on a finite alphabet of prime cardinal&y are chaotic in the sense of Devaney.
منابع مشابه
Topological Definitions of Chaos Applied to Cellular Automata Dynamics
We apply the two different definitions of chaos given by Devaney and by Knudsen for general discrete time dynamical systems (DTDS) to the case of 1-dimensional cellular automata. A DTDS is chaotic according to the Devaney’s definition of chaos iff it is topologically transitive, has dense periodic orbits, and it is sensitive to initial conditions. A DTDS is chaotic according to the Knudsen’s de...
متن کاملApplying snapback repellers in resource budget models.
In Satake's generalized resource budget model of ecology, which was modified from Isagi's resource budget model, Satake and Iwasa illustrated, by computing the positive Lyapunov exponent, that if the depletion coefficient is greater than one, then the system is chaotic. However, a positive Lyapunov exponent implies only sensitivity in Devaney's chaos. Therefore, this work presents mathematical ...
متن کاملTwo Novel Chaos-Based Algorithms for Image and Video Watermarking
In this paper we introduce two innovative image and video watermarking algorithms. The paper’s main emphasis is on the use of chaotic maps to boost the algorithms’ security and resistance against attacks. By encrypting the watermark information in a one dimensional chaotic map, we make the extraction of watermark for potential attackers very hard. In another approach, we select embedding po...
متن کاملThe Research of Image Encryption Algorithm Based on Chaos Cellular Automata
The Research presents an image encryption algorithm which bases on chaotic cellular automata. This algorithm makes use of features that extreme sensitivity of chaotic system to initial conditions, the cellular automaton with a high degree of parallel processing. The encryption algorithm uses two-dimensional chaotic system to Encrypt image, Then establish a cellular automaton model on the initia...
متن کاملFormal Languages and Finite Cellular Automata
A bst ract. A one-dimensional cellular automaton rule with specified boundary conditions can be considered as acting simultaneously on all finite lattices, which gives a mapping between formal languages. Regular lang uages are always mapped to regular langu ages, contex t-free to context-free, context-sensitive to context-sensitive, and recursive sets to recursive sets . In particular, the fini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 174 شماره
صفحات -
تاریخ انتشار 1997